Description: 该程序用贪心算法来求解0-1背包问题 采用贪婪准则：每次选择p/w最大的物品放入背包。-procedures with the greedy algorithm to solve 0-1 knapsack problem using greed criteria : Each choice p/w largest goods Add backpack. Platform: |
Size: 2048 |
Author:杨晨 |
Hits:
Description: 运用贪婪算法能够很好解决0/1背包问题，这是我编的一个小程序，运行过很好。-greedy algorithm can be used to solve a very good 0/1 knapsack problem, this is my part of a small program running very good. Platform: |
Size: 1024 |
Author:应吉平 |
Hits:
Description: 背包问题的贪婪算法，需要的下，不需要帐号的，自由的下。-knapsack problem of greedy algorithm, need, need not account, free under. Platform: |
Size: 1024 |
Author:王少石 |
Hits:
Description: 用多种算法解决0－1背包问题，包括回朔法，动态规划，贪心算法等-algorithm used to solve a variety of 0-1 knapsack problem, including the retrospective method, dynamic programming, greedy algorithm Platform: |
Size: 431104 |
Author:王垂宇 |
Hits:
Description: 背包问题非常有用的程序代码打包，包括贪心，回溯，动态规划-Knapsack problem is very useful package of program code, including greedy, backtracking, dynamic programming Platform: |
Size: 6128640 |
Author:adsd |
Hits:
Description: 此程序是使用Java编写的，实现了可分割的0/1背包问题。程序主要是是使用了经典的贪心算法，能够很好的解决此问题。-This procedure is to use Java prepared to achieve that can be separated from 0/1 knapsack problem. Procedure is mainly the use of a classic greedy algorithm that can solve this problem. Platform: |
Size: 4096 |
Author:gengxin |
Hits:
Description: 0／1背包问题的贪心优化解法 邓宏涛朱蜘
(江汉大学数学与计算机学院武汉430056)
摘要：介绍了0／1背包问题的基本贪心算法的解决策略，通过对贪心算法的改进和优化，找出0／1背包问题的最优解
的很好近似。-0/1 knapsack problem greedy optimization method of邓宏涛Zhu spider (Jianghan University, Mathematics and Computer Science, Wuhan 430056) Abstract: 0/1 knapsack problem of the greedy algorithm to solve the basic strategy of the greedy algorithm through the improvement and optimization, to find 0/1 knapsack problem of the optimal solution of a very good approximation. Platform: |
Size: 175104 |
Author:qqq |
Hits:
Description: 背包问题是用贪心算法得到最优解得一个典型问题。背包问题具有最优子结构性质首先通过快速排序算法对物品按照单价从大到小排序，然后进行贪心选择。-Knapsack problem is a greedy algorithm with the optimal solution may be a typical problem. Knapsack problem with the nature of the optimal sub-structure, first of all, quick sort algorithm to sort items in accordance with the smallest unit, and then choose to greed. Platform: |
Size: 1024 |
Author:workfuture |
Hits:
Description: 使用贪心算法解决经典背包问题的C语言实现。-Using the greedy algorithm to solve the classic knapsack problem C language. Platform: |
Size: 527360 |
Author:靳舒馨 |
Hits:
Description: 这是一个关于0-1背包问题算法的编程实现，包括了动态规划、分支界限、回溯、贪心算法-This is a 0-1 Knapsack Problem programming, including dynamic programming, branch and bound, backtracking, greedy algorithm Platform: |
Size: 2156544 |
Author:哈达 |
Hits:
Description: 1）编程实现背包问题贪心算法和最小生成树prim算法。通过具体算法理解如何通过局部最优实现全局最优，并验证算法的时间复杂性。
2）输入5个的图的邻接矩阵，程序加入统计prim算法访问图的节点数和边数的语句。
3） 将统计数与复杂性函数所计算的比较次数比较，用表格列出比较结果，给出文字分析。
4）背包问题的实验数据如下表：n=8,m=110
-1) programming to implement the knapsack problem greedy algorithm and minimum spanning tree prim algorithm. Through the concrete algorithm, it is understood how to achieve the global optimization through local optimization, and the time complexity of the algorithm is verified.
2) enter the adjacency matrix of the 5 graphs, add the number of nodes and the number of edges in the prim algorithm.
3) comparison of the number of statistics and the calculation of the complexity function, the comparison results are listed in the table.
4) the experimental data of knapsack problem are as follows: m=110, n=8 Platform: |
Size: 12288 |
Author:陈倩 |
Hits:
Description: 用贪婪算法解决背包问题，使用的语言是C语言。写了一个小程序并与传统的程序进行了比较。-Greedy algorithm to solve knapsack problem, the language used is C language. A small program is writen and compared with the traditional procedure were . Platform: |
Size: 1024 |
Author:翟小兵 |
Hits:
Search - knapsack problem greedy